Garuda - Garba Rujukan Digital

p-Index From 2019 - 2024

8.404

P-Index

This Author published in this journals

All Journal International Journal of Electrical and Computer Engineering Jurnal Ilmu Dasar Jurnal Edukasi Universitas Jember KADIKMA CAUCHY: Jurnal Matematika Murni dan Aplikasi Tadris: Jurnal keguruan dan Ilmu Tarbiyah Saintifika Prosiding Seminar Matematika dan Pendidikan Matematik UNEJ e-Proceeding Al-Jabar : Jurnal Pendidikan Matematika BAREKENG: Jurnal Ilmu Matematika dan Terapan Indonesian Journal of Combinatorics Al-Khwarizmi: Jurnal Pendidikan Matematika dan Ilmu Pengetahuan Alam Jurnal Riset Pendidikan dan Inovasi Pembelajaran Matematika (JRPIPM) Alifmatika: Jurnal Pendidikan dan Pembelajaran Matematika CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Pancaran Pendidikan SAINTIFIKA

D. Dafik

Universitas Jember, Indonesia

Author-ID : 488491

Religion Agriculture, Biological Sciences & Forestry Humanities Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Health Professions Languange, Linguistic, Communication & Media Mathematics Mechanical Engineering Medicine & Pharmacology Physics Social Sciences Transportation Other

Published : 229 Documents Claim Missing Document

Claim Missing Document

Articles

Title

1 2 3 4 5

Pewarnaan Titik r-Dinamis pada Graf Hasil Operasi Edge Corona Adelia Putri Liowardani; Dafik Dafik; Arif Fatahillah
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 2 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

This research is a development of research on $r$-dynamic vertex coloring on simple, connected, and undirected graphs. The $r$dynamic vertex coloring on the graph $G$ is the $r$ point coloring of the $r$ graph so that the vertices of degree two on the $G$ graph have at least two different color neighbors. The $r$-dynamic vertex coloring is satisfied if it meets the conditions for $\forall v \in V(G)$, $|c(N(v))|$ $\geq$ min$\{r,d(v)\}$. The chromatic number for the $r$-dynamic vertex coloring of the graph $G$ is denoted as $\chi_r(G)$. In this study, we discuss the $r$-dynamic vertex coloring on the graph resulting from the \emph{edge corona} operation on a path graph with a complete graph, a star graph, and a sweep graph. It is denoted that the result of the operation of \emph{edge corona} graph $G$ and graph $H$ is $G \diamond H$. In this study, the results of the $r$-dynamic vertex coloring are described in the operation graph $P_n \diamond K_m$, $P_n \diamond S_m$, $P_n \diamond P_m$, and $P_n \diamond B_{(m,k)}

On the Domination Number of Some Graph Operations N Y. Sari; I H. Agustin; Dafik Dafik
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 1 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

A set D of vertices of a simple graph G, that is a graph without loops and multiple edges, is called a dominating set if every vertex u ∈ V (G) − D is adja-cent to some vertex v ∈ D. The domination number of a graph G, denoted by γ(G), is the order of a smallest dominating set of G. A dominating set D with |D| = γ(G) is called a minimum dominating set. This research aims to char-acterize the domination number of some graph operations, namely joint graphs, coronation of graphs, graph compositions, tensor product of two graphs, and graph amalgamation. The results shows that most of the resulting domination numbers attain the given lower bound of γ(G). Keywords: Dominating set, domination number,

Rainbow Vertex Connection Number pada Keluarga Graf Roda Firman Firman; Dafik Dafik; Ermita Rizki Albirri
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 3, No 1 (2022): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

The rainbow vertex connection was first introduced by krivelevich and yuster in 2009 which is an extension of the rainbow connection. Let graph $G =(V,E)$ is a connected graph. Rainbow vertex-connection is the assignment of color to the vertices of a graph $G$, if every vertex on graph $G$ is connected by a path that has interior vertices with different colors. The minimum number of colors from the rainbow vertex coloring in graph $G$ is called rainbow vertex connection number which is denoted $rvc(G)$. The result of the research are the rainbow vertex connection number of family wheel graphs.

Analysis Creative Thinking Pattern on X Sains 2 at SMAN 2 Jember to Solving Open Ended Problem of Space and Shape Elsa Yuli Kurniawati; Dafik Dafik; Arif Fatahillah
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 2 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Math learning to train people to think critically, creatively, logical, analytical and systematic. In reality, mathematics is often regarded as the science that emphasizes logical thinking with a unique solution and certainly, so that students do not have the flexibility to develop creative ideas. The condition causes low creativity of students in learning mathematics. Curriculum 2006 stated that creative thinking skills needed to master the science of the future, given that today's science and technology is developing very rapidly \cite{BSNP}. Thus, the ability to think creatively is important to develop. This study describes the rate and the process of creative thinking class X IPA 2 SMA Negeri 2 Jember, in solving open ended problems. Instruments used in this research is to test the ability to think creatively package A and package B, questionnaires and interview guidelines. Of the 36 students of class X IPA 2 SMA Negeri 2 Jember included TBK 0 (not creative) as much as two students (5.56\%), TBK 1 (less creative) as many as twenty students (55.56\%), TBK 2 (enough creative) thirteen students (36.1\%), TBK 3 (creative) only one student (2.78\%) and no students were able to achieve TBK 4 (very creative). Because there are only four levels of creative thinking then taken four students as research subjects who identified the creative thinking process. Students TBK 3 very fulfilling to aspects of fluency and flexibility aspects, but for the novelty aspect is still lacking. Students TBK 2 only meet the flexibility aspect alone. Students TBK 1 which fulfills the eloquence alone. Students who do not meet the TBK 0 fluency aspect, the aspect of flexibility and novelty aspect.

Chromatics Number of Operation Graphs Kiki Kurdianto; Ika Hesti Agustin; Dafik Dafik
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 1 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Let G = (V (G); E(G)) be connected nontrivial graph. Edge coloring is de-¯ned as c : E(G) ! f1; 2; :::; kg; k 2 N, with the conditions no edges adja-cent having the same color. Coloring k-color edges r-dynamic is edges color-ing as much as k color such that every edges in E(G) with adjacent at least minfr; d(u) + d(v) ¡ 2g have di®erent color. An Edge r dynamic is a proper c of E(G) such that jc(N(uv))j = minfr; d(u) + d(v) ¡ 2g, for each edge N(uv) is the neighborhood of uv and c(N(uv)) is color used to with adjacent edges of uv. the edge r-dynamic chromatic number, written as ¸(G), is the minimum k such that G has an edge r-dynamic k-coloring. chromatic number 1-dynamic writ-ten as ¸(G), chromatic number 2-dynamic written as ¸d(G) And for chromatic number r-dynamic written as ¸(G). A graph is used in this research namely gshack(H3; e; n), amal(Bt3; v; n) and amal(S4; v; n). Keywords: r-dynamic coloring, r-dynamic chromatic number, graph operations.

Analisa Pewarnaan Total r-Dinamis pada Graf Lintasan dan Graf Hasil Operasi Desi Febriani Putri; Dafik Dafik; Kusbudiono Kusbudiono
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 2, No 1 (2021): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Graph coloring began to be developed into coloring dynamic. One of the developments of dynamic coloring is $r$-dynamic total coloring. Suppose $G=(V(G),E(G))$ is a non-trivial connected graph. Total coloring is defined as $c:(V(G) \cup E(G))\rightarrow {1,2,...,k}, k \in N$, with condition two adjacent vertices and the edge that is adjacent to the vertex must have a different color. $r$-dynamic total coloring defined as the mapping of the function $c$ from the set of vertices and edges $(V(G)\cup E(G))$ such that for every vertex $v \in V(G)$ satisfy $|c(N(v))| = min{[r,d(v)+|N(v)|]}$, and for each edge $e=uv \in E(G)$ satisfy $|c(N(e))| = min{[r,d(u)+d(v)]}$. The minimal $k$ of color is called $r$-dynamic total chromatic number denoted by $\chi^{\prime\prime}(G)$. The $1$-dynamic total chromatic number is denoted by $\chi^{\prime\prime}(G)$, chromatic number $2$-dynamic denoted with $\chi^{\prime\prime}_d(G)$ and $r$-dynamic chromatic number denoted by $\chi^{\prime\prime}_r(G)$. The graph that used in this research are path graph, $shackle$ of book graph $(shack(B_2,v,n)$ and \emph{generalized shackle} of graph \emph{friendship} $gshack({\bf F}_4,e,n)$.

Bilangan Kromatik Graceful pada Keluarga Graf Unicyclic Nafisa Afwa Sania; Dafik Dafik; Arif Fatahillah
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 2 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Suppose $ G $ is a graph, where $ G = \{V (G), E (G) \} $. Graceful coloring is defined by $ c: V (G) \to \{1,2, ..., k \} $ which induces a proper edge coloring $ c': E (G) \to \{1,2, ..., k- 1 \}$ defined by $c'(xy)=|c(x)-c(y)|$, where $ k \geq 2 $, $ k \in N $. Coloring is said to be graceful if these 3 conditions are satisfied, namely the proper vertex color, the proper edge color, and the edge color, which are the absolute difference between the color of the accident vertex. The subgraph $H$ on that graceful coloring is smaller than the $G$. Furthermore, one of the subgraphs in the unicyclic graph family is a cycle graph. The graceful chromatic number on a graph denoted by $ \chi_g (G) $, is the optimum number of graceful colors from graph $G$. This research aims to find graceful chromatic numbers in the unicyclic graph family, namely bull graphs, net graphs, cricket graphs, caveman graphs, peach graphs, and flowerpot graphs. The results of this study indicate that $\chi_g(C_l) \geq 4$, where $C_l$ is a unicyclic graphs.

Super (a; d) - Face Antimagic Total Labeling of Connective Shackle Graph (C5; e; n) Siska Binastuti; Dafik Dafik; Arif Fatahillah
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 1 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Let G be a simple graph of order p, size q and face r. The graph G is called a super (a; d) - face antimagic total labeling , if there exist a bijection f : V (G) [ E(G) [ F (G) ! f1; 2; :::; p + q + rg such that the set of s-sided face weights, Ws = fas; as + d; as + 2d; :::; as + (rs ¡1)dg form an arithmetic sequence with ¯rst term a,common di®erence d, where a and d are positive integers s and rs is the number of s-sided faces. Such a graph is called super if the smallest possible labels appear on the vertices. The type of Face Antimagic Labeling is (1,1,1). In this paper, describe of Super (a; d) - Face Antimagic of Connective Shackle (C5; e; n) Graph. Keywords: Super (a; d)-face antimagic total labeling, face antimagic la-beling.

Pewarnaan Titik Ketakteraturan Lokal Refleksif pada Keluarga Graf Tangga Rizki Aulia Akbar; Dafik Dafik; Rafiantika Megahnia Prihandini
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 3, No 1 (2022): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Let a simple and connected graph $G=(V,E)$ with the vertex set $V(G)$ and the edge set E(G). If there is a mapping $f$: $V(G)$ $\rightarrow$ ${0,2,…,2k_v}$ and $f$: $E(G)$ $\rightarrow$ ${1,2,…,k_e}$ as a function of vertex and edge irregularities labeling with $k=max$ ${2k_v,k_e}$ for $k_v$ and $k_e$ natural numbers and the associated weight of vertex $u,v \in V(G)$ under $f$ is $w(u)=f(u)+\sum_{u,v\in E(G)}f(uv)$. Then the function $f$ is called a local vertex irregular reflexive labeling if every adjacent vertices has distinct vertex weight. When each vertex of graph $G$ is colored with a vertex weight $w(u,v)$, then graph $G$ is said to have a local vertex irregular reflexive coloring. Minimum number of vertex weight is needed to color the vertices in graf $G$ such that any adjacent vertices are not have the same color is called a local vertex irregular reflexive chromatic number, denoted by $\chi_{(lrvs)}(G)$. The minimum $k$ required such that $\chi_{(lrvs)}(G)=\chi(G)$ where $\chi(G)$ is chromatic number of proper coloring on G is called local reflexive vertex color strength, denoted by $lrvcs(G)$. In this paper, we will examine the local reflexive vertex color strength of local vertex irregular reflexive coloring on the family of ladder graph.

Kajian Rainbow 2-Connected Pada Graf Eksponensial dan Beberapa Operasi Graf Herninda Lucky Oktaviana; Ika Hesti Agustin; Dafik Dafik
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 2, No 2 (2021): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Let $G=(V(G),E(G))$ is a graph connected non-trivial. \textit{Rainbow connection} is edge coloring on the graph defined as $f:E(G)\rightarrow \{1,2,...,r|r \in N\}$, for every two distinct vertices in $G$ have at least one \textit{rainbow path}. The graph $G$ says \textit{rainbow connected} if every two vertices are different in $G$ associated with \textit{rainbow path}. A path $u-v$ in $G$ says \textit{rainbow path} if there are no two edges in the trajectory of the same color. The edge coloring sisi cause $G$ to be \textit{rainbow connected} called \textit{rainbow coloring}. Minimum coloring in a graph $G$ called \textit{rainbow connection number} which is denoted by $rc(G)$. If the graph $G$ has at least two \textit{disjoint rainbow path} connecting two distinct vertices in $G$. So graph $G$ is called \textit{rainbow 2-connected} which is denoted by $rc_2(G)$. The purpose of this research is to determine \textit{rainbow 2-connected} of some resulting graph operations. This research study \textit{rainbow 2-connected} on the graph (${C_4}^{K_n}$ and $Wd_{(3,2)}\square K_n$).

Co-Authors A Arynda A H Rahmatillah A. Y. Harsya Adelia Putri Liowardani Adelia Putri Liowardani Agnes Ika Nurvitaningrum, Agnes Ika Agrita Kanty Purnapraja, Agrita Kanty Agustina M. Agustina Muharromah, Agustina Ahmad Adi Ahmad Musyaffa' Hikamuddin Ahmad Syaiful Rizal, Ahmad Syaiful Aldyon Restu Azkarahman Alfian Yulia Harsya, Alfian Yulia Alfin Nabila Taufik Amalina, Putri Nur Anindyta Anggirena Wulandari Anindyta Anggirena Wulandari Anisa Meilinda Wardani Antonius C. Prihandoko arief fatahillah Arika I. Kristiana Arika Indah Kriatiana Arika Indah Kristiana Arnasyitha Yulianti S, Arnasyitha Arnasyitha Yulianti Soelistya Artanty Nastiti, Artanty Bayu Aprilianto Darian Aji Bawono Desak Made Dwika Saniriati Desi Febriani Putri Desi Febriani Putri Desy Tri Puspasari Desy Tri Puspasari, Desy Tri Devi Eka Wardani M, Devi Eka Dewi Anggraeni Dewi ANGGRAENI Dian Anita Hadi Dian Anita Hadi, Dian Anita Didik Sugeng Didin Trisnani, Didin Dina Tri Djoni Budi Sumarno Dwi Agustin Retnowardani Dyna Probo Mukti Elitta P Dewy Elok Asmaul Husna Elok Asmaul Husna Elsa Yuli Kurniawati Elsa Yuli Kurniawati Elsy Wijayanti Elsy Wijayanti Endang Wahyuningrum Ermita R Albirri Ermita Rizki Albirri Ervin Eka Riastutik Ervin Eka Riastutik, Ervin Eka Ervin Oktavianingtyas Erwinda Viantasari Excelsa Suli Wildhatul Jannah Farah Rezita Nurtaatti, Farah Rezita Fathulloh Faruq Fia Cholidah, Fia Firman Firman Fitri Wulandari Fitri Wulandari Gembong A. W. Hani'ah Zakin Harianto Setiawan, Harianto Hendry Dwi Saputro Herninda Lucky Oktaviana Hilmiyah Hanani Hilmiyah Hanani Hobri I H Agustin I H. Agustin I Ikhwandi I M Tirta I Made Tirta Ida Ariska Ika Hesti A. Ika Hesti Agustin, Ika Hesti Ika Mareta Ika Nur Maylisa Imanul Umar Hawari Imro’atun Rofikah Indar Setiani Indi Izzah Makhfduloh Inge Yosanda Arianti, Inge Yosanda Irma Azizah Irma Azizah, Irma Istamala Idha Retnoningsih Jackson P Mairing Jamhari Jamhari Jesi Irwanto, Jesi Joni Susanto Joni Susanto, Joni Juanda Brahmanto K Kasturi K Khasan, K Karinda Rizqy Aprilia, Karinda Rizqy Khilyah Munawaroh Kholifatu Rosyidah Kholifatur Rosyidah Kiki Kurdianto Kiswara Agung Santoso Kurniawati, Elsa Yuli Kusbudiono Kusbudiono, Kusbudiono Laily Anisa Nurhidayati Laily Anisa Nurhidayati Lubis Muzaki Lusia Dewi Minarti Lusia Dewi Minarti M. Wildan Athoillah Marsidi Marsidi Miftahur Roifah Millatuz Zahroh, Millatuz Moch. Avel Romanza P Moch. Avel Romanza P, Moch. Avel Romanza Mohammad Fadli Rahman Mohammad Fadli Rahman Muhamad Faizal Fatoni Muhammad Lutfi Asy’ari Muhlisatul Mahmudah Muhlisatul Mahmudah, Muhlisatul N Maylisa N Y. Sari Nabilah Ayu Az-Zahra Nafisa Afwa Sania Nindya Laksmita Dewi, Nindya Laksmita Novalita Anjelia Novalita Anjelia Novian Nur Fatihah Novita Cahya Mahendra Novita Sana Susanti Novri Anggraeni, Novri Nur Alfiyantiningsih Nur Asia Jamil, Nur Asia Nurcholif Diah Sri Lestari Nuris Hisan Nazula Nuryatul Laili Nuwaila Izzatul Muttaqi O A Safiati O. A. Safiati Ojat Darojat Okti Anis Safiati Prihandini, Rafiantika Megahnia Putri Ayu Permatasari Putri Indah Pratiwi Putri Rizky H.P, Putri Rizky Putu Liana Wardani Q Qoriatul QurrotaAÃ¢Â€Â™yuniArRuhimat AÃ¢Â€Â™yuni ArRuhimat QurrotaA’yuniArRuhimat A’yuni ArRuhimat Qurrotul A’yun Quthrotul Aini Fuidah R Adawiyah R M Prihandini R Ratih R Rohmatullah R. Humaizah Rafiantika M Rafiantika Megahnia Prihandini Randhi N. Darmawan, Randhi N. Randi Pratama Murtikusuma Ratna Syafitri Ratna Syafitri Reza Mega Ardhilia Ridho Alfarisi Ridho Alfarisi, Ridho Riniatul Nur Wahidah Rizki Aulia Akbar Robiatul Adawiyah Robiatul Adawiyah Robiatul Adawiyah Robiatul Adawiyah Rukmana Sholehah Rukmana Sholehah, Rukmana S Slamin S Suciati S Suharto S Sunardi S Susanto S Susanto S Susanto S Susanto S. Chususiyah S. M. Yunika Saddam Hussen Safira Izza Ghafrina Safira Izza Ghafrina Saifudin, Ilham Saniriati, Desak Made Dwika Shapbian Novindasari Shapbian Novindasari, Shapbian Shela Okta Grefina, Shela Okta Sherly Citra Wuni, Sherly Citra Sih Muhni Yunika, Sih Muhni Siska Aprilia Hardiyanti Siska Binastuti Siska Binastuti, Siska Siswono, Hendrik Siti Aminatus Solehah Siti Latifah Siti MarÃ¢Â€Â™atus Sholihah Siti Mar’atus Sholihah Soleh Chudin Sri Tresnaningsih Sufirman Sufirman Suntusia Suntusia Suparti Supratiningsih Supratiningsih Susanto Susanto Susanto Susanto Susi Setiawani Tanti Windartini, Tanti Tasrip Rudiono Tito Putra Mahendratama Sasongko Tommi Sanjaya Putra Toto Bara Setiawan Tri Dyah Prastiti Ulul Azmi Umi Azizah Anwar Viqedina Rizky Noviyanti Vutikatul Nur Rohmah Wahyu Nikmatus Sholihah Wahyu Sulistio Weny Wijayanti Weny Wijayanti, Weny Wicha Dwi Wicha Dwi Vikade, Wicha Dwi Y Yunita Yessy Eki Fajar Reksi Yuli Nur Azizah, Yuli Nur Z R Ridlo Zainur Rasyid Ridlo

Title Search

Found 41 Documents Search Journal : CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 41 Documents
Search
Journal : CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS